HierarchyMap: A Novel Approach to Treemap Visualization of Hierarchical Data

The HierarchyMap describes a novel approach for Treemap Visualization method for representing large volume of hierarchical information on a 2-dimensional space. HierarchyMap algorithm is a new ordered treemap algorithm. Results of the implementation of HierarchyMap treemap algorithm show that it is capable of representing several thousands of hierarchical data on 2-dimensional space on a computer and Portable Device Application (PDA) screens while still maintaining the qualities found in existing treemap algorithms such as readability, low aspect ratio, reduced run time, and reduced number of thin rectangles. The HierarchyMap treemap algorithm is implemented in Java programming language and tested with dataset of Departmental and Faculty systems of Universities, Family trees, Plant and Animal taxonomy structure

Application of Fuzzy Association Rule Mining for Analysing Students Academic Performance

This study examines the relationship between students’ preadmission academic profile and academic performance. Data sample of students in the Department of Computer Science in one of Nigeria private Universities was used. The preadmission academic profile considered includes ‘O’ level grades, University Matriculation Examination (UME) scores, and Post-UME scores. The academic performance is defined using students’ Grade Point Average (GPA) at the end of a particular session. Fuzzy Association Rule Mining (FARM) was used to identify the hidden relationships that exist between students’ pre-admission profile and academic performance. This study hopes to determine the academic profile of students who are most admitted in the session. It determines students’ performance ratings as against their pre-admission academic profile. This can serve as a predictor for admission committee to enhance the quality of the new in-take and guide for the academic advise

Design and Implementation of Meetings Document Management and Retrieval System

Meetings management system has components to capture, storing/archiving, retrieve, browse, and distribute documents from the system and Security to protect documents from unauthorized access. Lack of proper organization, storage and easy access of meeting documents, bottleneck of keeping paper documents, slow distribution, and misplacement of documents necessitated the need for this work. Document management software that can be used to organize and maintain the records of meetings has been developed. The system, developed as a web application, is based on the use of objects and Web technologies. A search facility is included to support rapid location of topics of interest, and navigation is enabled by the employment of hyperlinks. The system was implemented using asp.net. This document management system can enable users to follow the development of any topic through several meetings of a particular body or committee, Members of the body should be able to have instant and full access to what has been discussed and decided about the given issue no matter how long that had been

Comparative Analysis between Split and HierarchyMap Treemap Algorithms for Visualizing Hierarchical Data

We carried out comparative analysis between Split treemap algorithm and a more recently introduced treemap algorithm called HierarchyMap. HierrachyMap and Split are Treemap Visualization methods for representing large volume of hierarchical information on a 2-dimensional space. Split layout algorithm has been developed much earlier as an ordered layout algorithm with capability to preserve order and reduce aspect ratio. HierarchyMap is a newer ordered treemap algorithm developed to overcome certain deficiencies of the Split layout algorithm. The two algorithms were analyzed to compare their rate of complexity. They were also implemented using object-oriented programming tool and compared using a number of standard metrics for measuring treemap algorithms. Their implementation shows that HierarchyMap and Split although maintain the same level of data ordering and usability but HierarchyMap algorithm has better aspect ratio, better readability, low run-time, and less number of thin rectangles compared to Split treemap algorithm. Since aspect ratio is an important metric for determining the efficiency of treemaps on 2-D and small screens, and the result of the analysis shows that HierarchyMap is better efficient than Split treemap alagorithm, we conlude that HierarchyMap is more efficient than Split treemap algorithm

A SURVIVABLE DISTRIBUTED DATABASE AGAINST BYZANTINE FAILURE

Distributed Database Systems have been very useful technologies in making a wide range of information available to users across the World. However, there are now growing security concerns, arising from the use of distributed systems, particularly the ones attached to critical systems. More than ever before, data in distributed databases are more susceptible to attacks, failures or accidents owing to advanced knowledge explosions in network and database technologies. The imperfection of the existing security mechanisms coupled with the heightened and growing concerns for intrusion, attack, compromise or even failure owing to Byzantine failure are also contributing factors. The importance of  survivable distributed databases in the face of byzantine failure, to other emerging technologies is the motivation for this research. Furthermore, It has been observed that most of the existing works on distributed database only dwelled on maintaining data integrity and availability in the face of attack. There exist few on availability or survibability of distributed databases owing to internal factors such as internal sabotage or storage defects. In this paper, an architecture for entrenching survivability of Distributed Databases occasioned by Byzantine failures is proposed. The proposed architecture concept is based on re-creating data on failing database server based on a set  threshold value.The proposed architecture is tested and found to be capable of improving probability of survivability in distributed database where it is implemented to  99.6%  from 99.2%.

DEFECT SEGMENTATION TECHNIQUES FOR CERAMIC WALL TILE

This paper discussed the image processing algorithms that can be used to segment defects from the acquired ceramic tiles image. The paper proposed two gray-level threshold algorithms, a fixed threshold algorithm and an adoptive interpolating threshold algorithm. The two thresholding algorithms are tested across a set of test images and their performance compared using the area under receiver operator characteristic curves. The experimental results showed that the fixed threshold algorithm produces the receiver operator characteristic curve that encloses the greatest area and provides promising results in preference to the adaptive threshold algorithm

BINARY MORPHOLOGICAL IMAGE PROCESSING ALGORITHM IN COMPUTER VISION APPLICATION

Binary morphological image processing algorithm in computer vision application is reported.  The algorithm is simple in implementation and efficient in computation.  It is divided into two main parts, firstly method of enhancing occurring defects on the surface of manufactured product is introduced and secondly binary morphological filtering technique is developed to remove noise and other artifacts completely from the product binary images before feature extraction.  It has been shown that the algorithm produces good results when tested on a number of manufactured products.  The results presented in real images of a ceramic wall tile and biscuit shows the effectiveness of the algorithm

APPLICATION OF RING LIGHT IN AUTOMATIC SURFACE QUALITY INSPECTION

The most important factor for detecting defects in machine vision inspection is illumination.  This paper describes the basic lighting concepts and lighting techniques for industrial applications of machine vision.  In the paper analytical equations for illumination on the inspected objects using ring-light are determined. Application to the production line shows that ring-light illumination is an effective means of providing constant illumination and perfectly detects defects such as cracks when tested on a number of ceramic tiles with real defects